Unifiability in extensions of K4
نویسندگان
چکیده
We give a semantic characterization for unifiability and non-unifiability in the extensions of K4. We apply this in particular to extensions of KD4, GL and K4.3 to obtain a syntacic characterization and give a concrete decision procedure for unifiability for those logics. For that purpose we use universal models.
منابع مشابه
The Ramsey Multiplicity of K4
With the help of computer algorithms, we improve the lower bound on the Ramsey multiplicity of K4, and thus show that the exact value of it is equal to 9. The Ramsey multiplicity M(G) of a graph G is defined as the smallest number of monochromatic copies ofG in any two-coloring of edges of KR(G), whereR(G) is the Ramsey number of G, i.e. the smallest integer n such that any two-coloring of edge...
متن کاملThe degree distribution in unlabelled 2-connected graph families
An outerplanar graph is a planar graph which can be embedded in the plane such that all nodes lie on the outer face. A series-parallel graph is a graph which is the result of series (subdivision) or parallel (doubling) extensions of the edges of a forest. (Both graph families can be described via families of forbidden minors {K4,K23} and {K4}, respectively, where K4 denotes the complete graph o...
متن کاملA Resolution-Based Decision Procedure for Extensions of K4
This paper presents a resolution decision procedure for transitive propositional modal logics. The procedure combines the relational translation method with an ordered chaining calculus designed to avoid unnecessary inferences with transitive relations. We show the logics K4, KD4 and S4 can be transformed into a bounded class of well-structured clauses closed under ordered resolution and negati...
متن کاملE - unification by means of tree tuple synchronized grammars Sébastien Limet and Pierre
LIFO Université d’Orléans, B.P. 6759, 45067 Orléans cedex 2, France E-Mail: flimet, retyg @lifo.univ-orleans.fr The goal of this paper is both to give an E-unification procedure that always terminates, and to decide unifiability. For this, we assume that the equational theory is specified by a confluent and constructor-based rewrite system, and that four additional restrictions are satisfied. W...
متن کاملE-Unification by Means of Tree Tuple Synchronized Grammars
LIFO Université d’Orléans B.P. 6759, 45067 Orléans cedex 2, France e-mail : flimet, [email protected] The goal of this paper is both to give a E-unification procedure that always terminates, and to decide unifiability. For this, we assume that the equational theory is specified by a confluent and constructor-based rewrite system, and that four additional restrictions are satisfied. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Logic Journal of the IGPL
دوره 17 شماره
صفحات -
تاریخ انتشار 2009